A new application of the generalized traveling salesman problem in industry 4.0 and 5.0

The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach

The Generalized Traveling Salesman Problem (GTSP) is a modification of the Traveling Salesman Problem in which nodes are partitioned into clusters and exactly one node from each cluster is visited in a cycle. It has numerous applications, including airplane routing, computer file sequencing, and postal delivery. To produce solutions to this problem, a genetic algorithm (GA) heuristic mimicking ...

New Formulations for the Generalized Traveling Salesman Problem

The Generalized Traveling Salesman Problem (GTSP) is an extension of the well known Traveling Salesman Problem (TSP). The GTSP is defined on a graph in which the nodes (customers or vertices) are grouped into a given number of clusters (node sets). Solution procedures for the GTSP are generally focused on transforming the problem to the TSP and applying the exact or heuristic solution methods d...

application of brand personality scale in automobile industry: the study of samand’s brand personality dimensions

این تحقیق شخصیت برند سمند را در ایران با استفاده از مدل پنج بعدی آکر (1997) بعنوان یک چهارچوب بطور توصیفی سنجیده است. بنابر این چهارچوب که دراصل در 42 جزء (42 ویزگی شخصیتی) ودر پنج بعد شخصیتی طراحی شده بود ودر کشورها وصنایع مختلف آزموده شده بود, پرسنامه به زبان فارسی ترجمه شده و با استفاده از روشهای ترجمه معکوس و مصاحبه عمیق با 12 متخصص ایرانی به 38 جزء کاهش یافت. و نظرسنجی ای در پنج نمایندگی ا...

Generalized Traveling Salesman Problem Reduction Algorithms

The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The aim of this paper is to present a problem reduction algorithm that deletes redundant vertices and edges, preserving the value o...

The traveling salesman problem